play trace
Play Style Identification Using Low-Level Representations of Play Traces in MicroRTS
Xia, Ruizhe Yu, Gow, Jeremy, Lucas, Simon
Play style identification can provide valuable game design insights and enable adaptive experiences, with the potential to improve game playing agents. Previous work relies on domain knowledge to construct play trace representations using handcrafted features. More recent approaches incorporate the sequential structure of play traces but still require some level of domain abstraction. In this study, we explore the use of unsupervised CNN-LSTM autoencoder models to obtain latent representations directly from low-level play trace data in MicroRTS. We demonstrate that this approach yields a meaningful separation of different game playing agents in the latent space, reducing reliance on domain expertise and its associated biases. This latent space is then used to guide the exploration of diverse play styles within studied AI players.
- Europe > United Kingdom > England > Greater London > London (0.41)
- North America > Canada > Ontario > Toronto (0.04)
- Europe > Denmark > Capital Region > Copenhagen (0.04)
- Asia > China > Beijing > Beijing (0.04)
Playspecs: Regular Expressions for Game Play Traces
Osborn, Joseph Carter (University of California, Santa Cruz) | Samuel, Ben (University of California, Santa Cruz) | Mateas, Michael (University of California, Santa Cruz) | Wardrip-Fruin, Noah (University of California, Santa Cruz)
We introduce Playspecs, an application of omega-regular expressions to specifying play traces (sequences of game states or events unfolding over time). This connects the automated analysis and model checking of games to the literature on formal software verification via Bu ̈chi automata. We show how to define desirable or undesirable sequences of game events with Playspecs and how associated algorithms can find examples (or prove the impossibility) of such sequences. Playspecs have two main benefits over existing techniques for specifying the behaviors of a game over time. First, they offer a scalable commitment to formal modeling: the same Playspecs can filter existing traces gathered by telemetry, search for satisfying traces using existing game code, or drive formal verification when paired with a logical model of a game. Second, Playspecs' syntax can be customized for the game engine or game in question so designers may write specifications using their game's native vocabulary. We define Playspecs' syntax and semantics (modulo gamespecific customizations) and outline algorithms for each of the applications mentioned above, providing examples from the social simulation game Prom Week and the puzzle game engine PuzzleScript.
- Asia > Middle East > Jordan (0.05)
- Europe > Netherlands > South Holland > Delft (0.04)
- North America > United States > New York > New York County > New York City (0.04)
- (3 more...)
- Information Technology > Software Engineering (1.00)
- Information Technology > Software (1.00)
- Information Technology > Artificial Intelligence > Representation & Reasoning > Logic & Formal Reasoning (0.88)
- Information Technology > Artificial Intelligence > Representation & Reasoning > Agents > Agent Societies (0.34)